Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Optimal sample size allocation for tests with multiple levels of stress with extreme value regression

In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

基于Multi-agent临床诊断支持系统的设计

根据临床诊断支持信息环境的特点,结合Agent技术,设计了一套基于Multi-agent的临床诊断支持系统(CDSS)。该系统具有异构性、分布性、并行性和可扩展性,能适应CDSS的要求,有效地提高CDSS的性能。     

美军数据链一体化建设及启示

通过总结美军数据链建设的现状与发展趋势,重点分析了美军数据链一体化建设中采取的基于数据转发、基于并行接口和基于消息标准多链路操作发展策略,并探讨了美军一体化建设过程中面临的问题。最后,结合数据链建设的实际情况,在汲取美军教训的基础上,提出了数据链一体化建设过程中应重点解决的问题。     

基于航迹跟踪的EKF应用研究

在复杂的电磁环境,对运动目标的跟踪检测成为目标定位跟踪领域的热点研究课题。介绍了雷达数据处理和EKF算法,并提出了在三维空间中EKF(扩展Kalman滤波)算法的应用,实时地跟踪三维空间中的运动目标,并进行了计算机模拟,验证了该算法具有的较好的鲁棒性和跟踪精度,能够满足现代战争的需要。     

作战飞机信息通信方法

通过对作战飞机信息通信方法的研究,指出了作战飞机进行信息通信的两种方法-语音通信和数码通信;并分析了数码通信的硬件结构和机载通信的硬件设备的工作原理.探讨了未来的网络中心战中基于网络化数码通信的方法,为未来空战基于网络中心战技术的实际应用奠定基础.     

自行火炮自动瞄准精度数据分析

通过自动瞄准精度的定义和测试方法简介,针对某自行火炮火控系统在自动瞄准精度测试中出现测量数据误差较大的现象,分析数据误差的原因,计算各种因素造成误差的大小,得出对自动瞄准精度影响最大的是车体姿态倾斜传感器误差、炮耳轴倾斜传感器的误差和炮耳轴与炮身轴线的不垂直度.鉴于此,自行火炮提出用火控软件的方法和工艺控制,减少自动瞄准误差和射击诸元装定误差,提高射击精度.     

机载多传感器角度融合跟踪结构与算法

未来战机的作战环境要求机载多传感器数据融合系统在仅有角度测量信息情况下仍须具有稳定的目标跟踪能力.对机载多传感器的角度融合跟踪系统的结构和算法进行了研究,分别给出了两个传感器同步测量时的集中式状态估计算法和异步测量时不损信息量的混合式状态估计算法,即顺序滤波方法,并对相应算法进行了仿真验证.     

舰艇编队多声纳数据融合

分析了标准kalman滤波(KF)和自适应kalman滤波(AKF)的原理,通过仿真实验,对两种滤波算法的性能进行比较.结合各种声纳的探测特性和水下目标的特点,建立了舰艇编队的数据融合方案.选用简单凸组合融合算法作为舰艇编队协同反潜的航迹融合算法,将多声纳融合系统的融合结果和简单交叉定位算法进行了比较研究.仿真实验结果表明:自适应kalman滤波比标准kalman滤波具有更好的目标跟踪性能,多声纳融合结果较简单交叉定位结果的性能有大幅度提高,所选用的融合算法航迹能够较好的与真实航迹吻合.